Bilattice-Based Squares and Triangles
نویسندگان
چکیده
In this paper, Ginsberg’s/Fitting’s theory of bilattices is invoked as a natural accommodation and powerful generalization to both intuitionistic fuzzy sets (IFSs) and interval-valued fuzzy sets (IVFSs), serving on one hand to clarify the exact nature of the relationship between these two common extensions of fuzzy sets, and on the other hand providing a general and intuitively attractive framework for the representation of uncertain and potentially conflicting information.
منابع مشابه
Poset-based Triangle: An Improved Alternative for Bilattice-based Triangle
Bilattice-based triangle provides elegant algebraic structure for reasoning with vague and uncertain information. But the truth and knowledge ordering of intervals in bilattice-based triangle can not deal with nonmonotonic reasoning and are not always intuitive. In this work, we construct an alternative algebraic structure, namely poset-based triangle and we provide with proper logical connecti...
متن کاملBilattice Public Announcement Logic
Building on recent work on bilattice modal logic and extensions of public announcement logic to a non-classical setting, we introduce a dynamic epistemic logic having the logic of modal bilattices as propositional support. Bilattice logic is both inconsistency-tolerant and paracomplete, thus suited for applications in contexts with multiple sources of information, where one may have to deal wit...
متن کاملMulti-Valued Logic Programming Semantics: An Algebraic Approach
In this paper we introduce the notion of join irreducibility in the context of bilattices and present a procedural semantics for bilattice based logic programs which uses as its basis the join irreducible elements of the knowledge part of the bilattice The join irreducible elements in a bilattice represent the primitive bits of information present within the system In bilattices which have the ...
متن کاملOn Approximation of the Semantic Operators Determined by Bilattice-Based Logic Programs
We introduce the class of bilattice-based annotated logic programs (BAPs). These programs extend the general annotated programs of Kifer and Subrahmanian to the bilattice case. The immediate consequence operator TP is defined for BAPs and its continuity is proven. A theorem of Seda concerning the approximation of the least fixed point of the two-valued TP -operator is generalized to the case of...
متن کاملSum of squares lower bounds from symmetry and a good story
In this paper, we develop machinery for proving sum of squares lower bounds on symmetric problems based on the intuition that sum of squares has difficulty capturing integrality arguments, i.e. arguments that an expression must be an integer. Using this machinery, we prove a tight sum of squares lower bound for the following Turan type problem: Minimize the number of triangles in a graph $G$ wi...
متن کامل